Totally invertible matrices — a combinatorial concept
نویسندگان
چکیده
منابع مشابه
Sums of Alternating Matrices and Invertible Matrices
A square matrix is said to be alternating-clean if it is the sum of an alternating matrix and an invertible matrix. In this paper, we determine all alternating-clean matrices over any division ring K. If K is not commutative, all matrices are alternating-clean, with the exception of the 1× 1 zero matrix. If K is commutative, all matrices are alternating-clean, with the exception of odd-size alt...
متن کاملFountain Codes and Invertible Matrices
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding ...
متن کاملPath Connectedness and Invertible Matrices
Though path-connectedness is a very geometric and visual property, math lets us formalize it and use it to gain geometric insight into spaces that we cannot visualize. In these notes, we will consider spaces of matrices, which (in general) we cannot draw as regions in R or R. To begin studying these spaces, we first explicitly define the concept of a path. Definition 1.1. A path in X is a conti...
متن کاملthe second immanant of some combinatorial matrices
let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...
متن کاملTotally Nonnegative (0, 1)-Matrices
We investigate (0, 1)-matrices which are totally nonnegative and therefore which have all of their eigenvalues equal to nonnegative real numbers. Such matrices are characterized by four forbidden submatrices (of orders 2 and 3). We show that the maximum number of 0s in an irreducible (0, 1)-matrix of order n is (n − 1) and characterize those matrices with this number of 0s. We also show that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90353-c